On covering designs with block size 5 and index 11≤λ≤21: the case v≡0(mod 4)

نویسندگان

  • Ahmed M. Assaf
  • L. P. S. Singh
چکیده

Let V be a finite set of order v. A (v,k,A.) covering design of index A. and block size k is a collection of k-element subsets, called blocks, such that every 2-subset of V occurs in at least '}.. blocks. The covering problem is to determine the minimum number of blocks, a (v, k, A.), in a covering design. It is well known that a(v,k''}..)Lr~~=~'}..ll=(v,k,A.), where rxl is the smallest integer

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balanced incomplete block designs with block size~9: Part III

The necessary conditions for the existence of a balanced incomplete block design on v points, with index λ and block size k, are that: λ(v − 1) ≡ 0 mod (k − 1) λv(v − 1) ≡ 0 mod k(k − 1) Earlier work has studied k = 9 with λ ∈ {1, 2, 3, 4, 6, 8, 9, 12}. In this article we show that the necessary conditions are sufficient for λ = 9 and every other λ not previously studied.

متن کامل

Super-simple balanced incomplete block designs with block size 4 and index 5

In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in other constructions, such as superimposed codes and perfect hash families etc. The existence of super-simple (v, 4, λ)-BIBDs have been determined for λ = 2, 3, 4 and 6. When λ = 5, the necessary conditions of such a d...

متن کامل

Super-simple balanced incomplete block designs with block size 5 and index 3

In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in constructing codes and designs such as superimposed codes and perfect hash families. The existence of super-simple (v, 4, λ)BIBDs have been determined for λ = 2, 3, 4, 5, 6. In this paper, we investigate the existence...

متن کامل

Splitting group divisible designs with block size 2×4

The necessary conditions for the existence of a (2 × 4, λ)-splitting GDD of type g are gv ≥ 8, λg(v−1) ≡ 0 (mod 4), λg2v(v−1) ≡ 0 (mod 32). It is proved in this paper that these conditions are also sufficient except for λ ≡ 0 (mod 16) and (g, v) = (3, 3).

متن کامل

Generalized Bhaskar Rao designs with block size three

We show that the necessary conditions λ = 0 (mod IGI), λ(v-l)=0 (mod2), λv(v 1) = [0 (mod 6) for IGI odd, (0 (mod 24) for IGI even, are sufficient for the existence of a generalized Bhaskar Rao design GBRD(v,b,r,3,λ;G) for the elementary abelian group G, of each order IGI. Disciplines Physical Sciences and Mathematics Publication Details Seberry, J, Generalized Bhaskar Rao designs with block si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1997